A Simple and Accurate Algorithm for Barycentric Rational Interpolation
نویسندگان
چکیده
منابع مشابه
Comments on "A Simple and Accurate Algorithm for Barycentric Rational Interpolation"
First, I would like to thank the author of ”Comments on ’A Simple and Accurate Algorithm for Barycentric Rational Interpolation’” (hereafter referred to as ”the comments”) for their interest in my work [1]. The author of the comments points out a novel relationship between barycentric rational interpolation, the Welch-Berlekamp key equation and Gröbner bases. This could turn out to be a very pr...
متن کاملPyramid algorithms for barycentric rational interpolation
We present a new perspective on the Floater–Hormann interpolant. This interpolant is rational of degree (n, d), reproduces polynomials of degree d, and has no real poles. By casting the evaluation of this interpolant as a pyramid algorithm, we first demonstrate a close relation to Neville’s algorithm. We then derive an O(nd) algorithm for computing the barycentric weights of the Floater–Hormann...
متن کاملLebesgue Constant Minimizing Bivariate Barycentric Rational Interpolation
The barycentric form is the most stable formula for a rational interpolant on a finite interval. The choice of the barycentric weights can ensure the absence of poles on the real line, so how to choose the optimal weights becomes a key question for bivariate barycentric rational interpolation. A new optimization algorithm is proposed for the best interpolation weights based on the Lebesgue cons...
متن کاملRecent advances in linear barycentric rational interpolation
Well-conditioned, stable and infinitely smooth interpolation in arbitrary nodes is by no means a trivial task, even in the univariate setting considered here; already the most important case, equispaced points, is not obvious. Certain approaches have nevertheless experienced significant developments in the last decades. In this paper we review one of them, linear barycentric rational interpolat...
متن کاملBarycentric rational interpolation at quasi-equidistant nodes
A collection of recent papers reveals that linear barycentric rational interpolation with the weights suggested by Floater and Hormann is a good choice for approximating smooth functions, especially when the interpolation nodes are equidistant. In the latter setting, the Lebesgue constant of this rational interpolation process is known to grow only logarithmically with the number of nodes. But ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2008
ISSN: 1070-9908
DOI: 10.1109/lsp.2007.913583